Descente par Frobenius Explicite pour les D†-Modules

Descente pour les n-champs

We develop the theory of n-stacks (or more generally Segal n-stacks which are∞-stacks such that the morphisms are invertible above degree n). This is done by systematically using the theory of closed model categories (cmc). Our main results are: a definition of n-stacks in terms of limits, which should be perfectly general for stacks of any type of objects; several other characterizations of n-...

Sur La Séparation Des Caractères Par Les Frobenius

In this paper, we are interested in the question of separating two characters of the absolute Galois group of a number field K, by the Frobenius of a prime ideal p of OK . We first recall an upper bound for the norm N(p) of the smallest such prime p, depending on the conductors and on the degrees. Then we give two applications: (i) find a prime number p for which P (mod p) has a certain type of...

Ensembles d ’ unicité pour les polynômes ∗

Let E ⊂ C be a compact set of positive logarithmic capacity. Let us suppose that for every polynomial P = id we have P −1 (E) = E. Then for all no constant polynomials f and g such that f −1 (E) = g −1 (E) we have f = g.

Représentation par graphe de mots manuscrits dans les images pour la recherche par similarité

Effective information retrieval on handwritten document images has always been a challenging task. In this paper, we propose a novel handwritten word spotting approach based on graph representation. The presented model comprises both topological and morphological signatures of handwriting. Skeleton-based graphs with the Shape Context labeled vertexes are established for connected components. Ea...

Une démarche dirigée par les modèles pour construire les machines de déploiement des intergiciels à composants